منابع مشابه
The Budgeted Maximum Coverage Problem
The budgeted maximum coverage problem is: given a collection S of sets with associated costs deened over a domain of weighted elements, and a budget L, nd a subset of S 0 S such that the total cost of sets in S 0 does not exceed L, and the total weight of elements covered by S 0 is maximized. This problem is NP-hard. For the special case of this problem, where each set has unit cost, a (1 ? 1 e...
متن کاملThe Generalized Maximum Coverage Problem
We define a new problem called the Generalized Maximum Coverage Problem (GMC). GMC is an extension of the Budgeted Maximum Coverage Problem, and it has important applications in wireless OFDMA scheduling. We use a variation of the greedy algorithm to produce a ( 2e−1 e−1 + )-approximation for every > 0, and then use partial enumeration to reduce the approximation ratio to e e−1 + .
متن کاملThe Maximum Facility Location Problem
In the maximum facility location problem, we are given a set of clients C and facilities F . Assigning a client u to a facility v incurs a cost w uv and each facility has an associated interval I v on the real line. Our goal is to assign as many clients to open facilities in order to maximise the cost of assignment, subject to the constraint that open facilities cannot have their respective int...
متن کاملOn Solving General Planar Maximum Coverage Location Problem with Partial Coverage
In this paper, we introduce a new generalization of the classical planar maximum coverage location problem (PMCLP) in which demand zones and service zone of each facility are represented by two-dimensional spatial objects such as circles, polygons, etc. In addition, we allow partial coverage in the foregoing generalization, i.e., covering only part of a demand zone is allowed and the coverage a...
متن کاملPlanar Maximum Coverage Location Problem with Partial Coverage and Rectangular Demand and Service Zones
We study the planar maximum coverage location problem (MCLP) with rectilinear distance and rectangular demand zones in the case where “partial coverage” is allowed in its true sense, i.e., when covering only part of a demand zone is allowed and the coverage accrued as a result of this is proportional to the demand of the covered part only. We pose the problem in a slightly more general form by ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Algebraic Discrete Methods
سال: 1983
ISSN: 0196-5212,2168-345X
DOI: 10.1137/0604028